Q Uantum G Ibbs Samplers : the Commuting Case
نویسنده
چکیده
We analyze the problem of preparing quantum Gibbs states of lattice spin Hamiltonians with local and commuting terms on a quantum computer and in nature. Our central result is an equivalence between the behavior of correlations in the Gibbs state and the mixing time of the semigroup which drives the system to thermal equilibrium (the Gibbs sampler). We introduce a framework for analyzing the correlation and mixing properties of quantum Gibbs states and quantum Gibbs samplers, which is rooted in the theory of non-commutative Lp spaces. We consider two distinct classes of Gibbs samplers, one of them being the well-studied Davies generator modelling the dynamics of a system due to weak-coupling with a large Markovian environment. We show that their spectral gap is independent of system size if, and only if, a certain strong form of clustering of correlations holds in the Gibbs state. Therefore every Gibbs state of a commuting Hamiltonian that satisfies clustering of correlations in this strong sense can be prepared efficiently on a quantum computer. As concrete applications of our formalism, we show that for every one-dimensional lattice system, or for systems in lattices of any dimension at temperatures above a certain threshold, the Gibbs samplers of commuting Hamiltonians are always gapped, giving an efficient way of preparing the associated Gibbs states on a quantum computer.
منابع مشابه
ON THE SZEGED INDEX OF NON-COMMUTATIVE GRAPH OF GENERAL LINEAR GROUP
Let $G$ be a non-abelian group and let $Z(G)$ be the center of $G$. Associate with $G$ there is agraph $Gamma_G$ as follows: Take $Gsetminus Z(G)$ as vertices of$Gamma_G$ and joint two distinct vertices $x$ and $y$ whenever$yxneq yx$. $Gamma_G$ is called the non-commuting graph of $G$. In recent years many interesting works have been done in non-commutative graph of groups. Computing the clique...
متن کاملCommuting Elements, Simplicial Spaces and Filtrations of Classifying Spaces
Let Γ denote the q-th stage of the descending central series of the free group on n generators Fn. For each q ≥ 2 and every topological group G, a simplicial space B∗(q, G) is constructed where Bn(q, G) = Hom(Fn/Γ , G) and the realizations B(q, G) = |B∗(q, G)| filter the classifying space BG. In particular for q = 2 this yields a single space B(2, G) assembled from all the n–tuples of commuting...
متن کاملON THE GROUPS WITH THE PARTICULAR NON-COMMUTING GRAPHS
Let $G$ be a non-abelian finite group. In this paper, we prove that $Gamma(G)$ is $K_4$-free if and only if $G cong A times P$, where $A$ is an abelian group, $P$ is a $2$-group and $G/Z(G) cong mathbb{ Z}_2 times mathbb{Z}_2$. Also, we show that $Gamma(G)$ is $K_{1,3}$-free if and only if $G cong {mathbb{S}}_3,~D_8$ or $Q_8$.
متن کاملRelative n-th non-commuting graphs of finite groups
Suppose $n$ is a fixed positive integer. We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$, associated to the non-abelian subgroup $H$ of group $G$. The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G : [x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$. Moreover, ${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...
متن کاملRound-Optimal ID-Based Blind Signature Schemes without ROS Assumption
This paper presents two Identity-Based Blind Signature (IBBS) schemes based on bilinear pairings. Both of them enjoy the following features. First, they achieve the optimal bound of round complexity for blind signatures, i.e., each signature can be blindly generated with one round (or two moves) of message exchanges between the signature requesting user and signer. Second, their security is pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016